Apply Partition Tree to Compute Canonical Labelings of Graphs
نویسندگان
چکیده
منابع مشابه
Using k-Mix-Neighborhood Subdigraphs to Compute Canonical Labelings of Digraphs
Jianqiang Hao 1,2,*, Yunzhan Gong 1, Yawen Wang 1, Li Tan 2 and Jianzhi Sun 2 1 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, 100876 Beijing, China; [email protected] (Y.G.); [email protected] (Y.W.) 2 School of Computer and Information Engineering, Beijing Technology and Business University, 100048 Beijing, China; tanli_91...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملMonochromatic Tree Partition for Complete Multipartite Graphs
An r-edge-coloring of a graph G is a surjective assignment of r colors to the edges of G. The monochromatic tree partition number of an redge-colored graph G is defined to be the minimum positive integer k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. In this paper, we give a direct proof for the m...
متن کاملLucky labelings of graphs
Suppose the vertices of a graph G were labeled arbitrarily by positive integers, and let S(v) denote the sum of labels over all neighbors of vertex v. A labeling is lucky if the function S is a proper coloring of G, that is, if we have S(u) 6= S(v) whenever u and v are adjacent. The least integer k for which a graph G has a lucky labeling from the set f1; 2; : : : ; kg is the lucky number of G,...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Grid and Distributed Computing
سال: 2016
ISSN: 2005-4262,2005-4262
DOI: 10.14257/ijgdc.2016.9.5.21